Efficient Subgroup Exponentiation in Quadratic and Sixth Degree Extensions
نویسندگان
چکیده
This paper describes several speedups for computation in the order p + 1 subgroup of Fp2 and the order p 2 − p + 1 subgroup of Fp6 . These results are in a way complementary to LUC and XTR, where computations in these groups are sped up using trace maps. As a side result, we present an efficient method for XTR with p ≡ 3 mod 4.
منابع مشابه
Efficient elliptic curve cryptosystems
Elliptic curve cryptosystems (ECC) are new generations of public key cryptosystems that have a smaller key size for the same level of security. The exponentiation on elliptic curve is the most important operation in ECC, so when the ECC is put into practice, the major problem is how to enhance the speed of the exponentiation. It is thus of great interest to develop algorithms for exponentiation...
متن کاملFaster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
This paper describes an extremely efficient squaring operation in the so-called ‘cyclotomic subgroup’ of F× q6 , for q ≡ 1 mod 6. Our result arises from considering the Weil restriction of scalars of this group from Fq6 to Fq2 , and provides efficiency improvements for both pairingbased and torus-based cryptographic protocols. In particular we argue that such fields are ideally suited for the l...
متن کاملEfficient classical simulations of quantum fourier transforms and normalizer circuits over Abelian groups
The quantum Fourier transform (QFT) is an important ingredient in various quantum algorithms which achieve superpolynomial speed-ups over classical computers. In this paper we study under which conditions the QFT can be simulated efficiently classically. We introduce a class of quantum circuits, called normalizer circuits: a normalizer circuit over a finite Abelian group is any quantum circuit ...
متن کاملSome extensions of Darbo's theorem and solutions of integral equations of Hammerstein type
In this brief note, using the technique of measures of noncompactness, we give some extensions of Darbo fixed point theorem. Also we prove an existence result for a quadratic integral equation of Hammerstein type on an unbounded interval in two variables which includes several classes of nonlinear integral equations of Hammerstein type. Furthermore, an example is presented to show the effic...
متن کاملDesigning Path for Robot Arm Extensions Series with the Aim of Avoiding Obstruction with Recurring Neural Network
In this paper, recurrent neural network is used for path planning in the joint space of the robot with obstacle in the workspace of the robot. To design the neural network, first a performance index has been defined as sum of square of error tracking of final executor. Then, obstacle avoidance scheme is presented based on its space coordinate and its minimum distance between the obstacle and ea...
متن کامل